Prime-factor GFFT Architecture for Fast Frequency Domain Decoding of Cyclic Codes

This letter introduces a prime-factor Galois field Fourier transform (PF-GFFT) architecture to frequency domain decoding (FDD) of cyclic codes. Firstly, fast FDD scheme is designed which converts the original single longer multi-dimensional smaller transform. Furthermore, ladder-shift for PF-GFFT explored solve rearrangement problem input and output data. In this regard, considered as lower order spectral calculation scheme, has sufficient preponderance in reducing computational complexity. Simulation results show that compares favorably with current general GFFT, simplified-GFFT (S-GFFT), circular shifts-GFFT (CS-GFFT) algorithms time-consuming cost, nearly an magnitude or than them. The superiority benefit improving speed potential application value codes code lengths.